Data abstraction and information hiding

نویسندگان
چکیده

منابع مشابه

Behavioral abstraction is hiding information

We show that for any behavioral Σ-specification B there is an ordinary algebraic specification B̃ over a larger signature, such that a model behaviorally satisfies B iff it satisfies, in the ordinary sense, the Σ-theorems of B̃. The idea is to add machinery for contexts and experiments (sorts, operations and equations), use it, and then hide it. We develop a procedure, called unhiding, which take...

متن کامل

Information Security through data Encryption and Data Hiding

Reference G. Eason, B. Noble, and I. N. Sneddon, “On certain integrals of Lipschitz-Hankel type involving products of Bessel functions,” Phil. Trans. Roy. Soc. London, vol. A247, pp. 529–551, April 1955. (references) J. Clerk Maxwell, A Treatise on Electricity and Magnetism, 3rd ed., vol. 2. Oxford: Clarendon, 1892, pp.68–73. I. S. Jacobs and C. P. Bean, “Fine particles, thin films and exchange...

متن کامل

Information Driven Evaluation of Data Hiding Algorithms

Privacy is one of the most important properties an information system must satisfy. A relatively new trend shows that classical access control techniques are not sufficient to guarantee privacy when datamining techniques are used. Privacy Preserving Data Mining (PPDM) algorithms have been recently introduced with the aim of modifying the database in such a way to prevent the discovery of sensib...

متن کامل

Digital Image Data Hiding Using Side Information

Robustness is a key issue for many prospective applications of data hiding technologies. The proposal to take into account side information at the encoder has meant a noteworthy advance in the quest for better data hiding methods. Still, the true impact of the advantages theoretically derived from this groundbreaking idea has not been sufficiently founded in practice. Departing from this situat...

متن کامل

Modular Enforcement of Supertype Abstraction and Information Hiding with Client-Side Checking

Static reasoning tools for object-oriented (OO) languages use supertype abstraction, by verifying calls to methods using the specification associated with the receiver’s static type. Unfortunately, contemporary runtime assertion checkers for OO are inconsistent with such static reasoning tools, since they check assertions in an overly-dynamic way on the supplier side. For method calls, such sup...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Programming Languages and Systems

سال: 2002

ISSN: 0164-0925,1558-4593

DOI: 10.1145/570886.570888